FPGA implementation of full-search vector quantization based on partial distance search

نویسندگان

  • Wen-Jyi Hwang
  • Wen-Kang Wei
  • Yao-Jung Yeh
چکیده

This paper presents a novel algorithm for field programmable gate array (FPGA) realization of vector quantizer (VQ) encoders using partial distance search (PDS). In most applications, the PDS is adopted as a software approach for attaining moderate codeword search acceleration. In this paper, a novel PDS algorithm well suited for hardware realization is proposed. The algorithm employs subspace search, bitplane reduction, and multiple-coefficient accumulation techniques for the effective reduction of the area complexity and computation latency. Concurrent encoding of different input vectors for further computation acceleration is also allowed by the employment of multiple-module PDS. The proposed implementation has been embedded in a softcore CPU for physical performance measurement. Experimental results show that the implementation provides a cost-effective solution to the FPGA realization of VQ encoding systems where both high throughput and high fidelity are desired. 2006 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A novel search algorithm for LSF VQ

Because classical fast vector quantization(VQ) algorithms can't be used in the LSF vector quantizers that use varying weighted Euclidean distance, a novel fast VQ search algorithm —CRVQCS (Constrained Range Vector Quantization based on Component Searching) is presented in this paper. The CRVQ-CS algorithm works well with the varying weighted Euclidean distance and yields the same result as full...

متن کامل

Optimal Feature-based Vector Quantization of Image Coding Using Integral Projection

This paper presents a fast algorithm of vector quantization for image coding that relies on three conditions of early termination to confine the search space, resulting in acceleration of the encoding process. These termination conditions are derived based on the gray-level features that are extracted from the individual vectors of pixels. Each incoming vector is compared to the codebook entrie...

متن کامل

A Fast Full Search Equivalent Formean - Shape - Gain Vector Quantizersj

Vector quantization is an eecient lossy digital signal compression method. It encodes a k-dimensional vector by a reference in a dictionary { or code-book { of representative vectors called codewords. Mean-shape-gain vector quantizers (MSGVQ) encode separately the mean and the length { or gain { of the vector, using two scalar quantizers. The mean-removed, normalized vector is called the shape,...

متن کامل

A fast full search equivalent encoding method for vector quantization by using appropriate features

The encoding process of vector quantization (VQ) is very heavy and it constrains VQ’s application to a great deal. In order to speed up VQ encoding, it is most important to avoid unnecessary Euclidean distance computation (k-D) as much as possible by the difference check first that uses simpler features (low dimensional) while winner searching is going on. Sum (1-D) and partial sums (2-D) are u...

متن کامل

An Efficient VQ Algorithm using Mean Value Predictive

Vector Quantization (VQ) [1], is an efficient technique for signal compression. In traditional VQ, the major computation is on searching the nearest codeword of the codebook for every input vector. Our search algorithm is based on partial distance Elimination (PDE) [2] and binary search is used to determine first search point. We sort the codebook by the mean value in pre-processing before all ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Microprocessors and Microsystems

دوره 31  شماره 

صفحات  -

تاریخ انتشار 2007